Partitions of hypergraphs under variable degeneracy constraints
نویسندگان
چکیده
منابع مشابه
Judicious Partitions of Hypergraphs
We prove the asymptotically best possible result that, for every integer k ≥ 2, every 3-uniform graph with m edges has a vertex-partition into k sets such that each set contains at most (1+o(1))m/k edges. We also consider related problems and conjecture a more general result.
متن کاملJudicious partitions of uniform hypergraphs
The vertices of any graph with m edges can be partitioned into two parts so that each part meets at least 2m 3 edges. Bollobás and Thomason conjectured that the vertices of any r-uniform graph may be likewise partitioned into r classes such that each part meets at least cm edges, with c = r 2r−1 . In this paper, we prove this conjecture for the case r = 3. In the course of the proof we shall al...
متن کاملCyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
A cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form {F, F , F θ 2 , . . . , F θ q−1 } for some permutation θ of the vertex set V . Let Vn = {1, 2, . . . , n}. For a positive integer k, ( Vn k ) denotes the set of all k-subsets of Vn. For a nonempty subset K of Vn−1, we let K n denote the hypergraph ( Vn, ⋃ k∈K ( Vn k )) . In this paper, we find a necessary an...
متن کاملRegular Partitions of Hypergraphs: Counting Lemmas
We continue the study of regular partitions of hypergraphs. In particular we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from [Regular partitions of hypergraphs: Regularity Lemmas, Combin. Probab. Comput., to appear].
متن کاملRegular partitions of hypergraphs and property testing
About 30 years ago Szemerédi developed the regularity method for graphs, which was a key ingredient in the proof of his famous density result concerning the upper density of subsets of the integers which contain no arithmetic progression of fixed length. Roughly speaking, the regularity lemma asserts, that the vertex set of every graph can be partitioned into a constant number of classes such t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22575